#define  _CRT_SECURE_NO_WARNINGS 1
#include <stdio.h>
//////int main()
//////{
//////	int i = 0;
//////	for (i = 1; i <= 50; i++)
//////	{
//////		int sum1 = 0;
//////		int sum2 = 0;
//////		sum1  + =  1/(2i);
//////		sum2 + =  + 1 / (2i-1);
//////		printf("%d", sum1 - sum2);
//////
//////
//////	}
//////
//////
//////
//////
//////
//////	return 0;
//////}
//////
//////////
////int main()
////{
////	int i = 0;
////	int count = 0;
////	int n = 0;
////	for (i = 1; i <= 10; i++)
////	{
////		int a = (10 * i - 1);
////		if (a <= 100)
////		{
////			count++;
////		}
////	}
////	printf("%d", count);
////	
////////
////////	return 0;

////int Fib(int n)
////{
////	if (n <= 2)
////		return 1;
////	else
////		return Fib(n - 1) + Fib(n - 2);
////}

//////
//
//
////i/*nt main()
//{
//	int i = 0;
//	int count = 0;
//	int n = 0;
//	for (i = 1; i <= 10; i++)
//	{
//		int a = (10 * i - 1);
//		if (a <= 100)
//		{
//			count++;
//		}
//	}
//	printf("%d", count);
//	
//
//	return 0;*/
////int Fib(int n)
////{
////	int a = 1;
////	int b = 1;
////	int c = 1;
////	while (n >= 3)
////	{
////		c = a + b;
////		a = b;
////		b = c;
////		n--;
////	}
////	return c;
////}
////int main()
////{
////	int n = 0;
////	scanf("%d", &n);
////	int ret = Fib(n);
////	printf("%d", ret);
////
////}
////
//////int Fib(int n, int k)
//////{
//////	int m = 0;
//////	int ret = n;
//////	for (m = 1; m < k; m++)
//////	{
//////
//////		ret = ret * n;
//////
//////	}
//////	return ret;
//////
//////}
//////
//////int main()
//////////{
//////////	int n = 0;
//////////	int k = 0;
//////////	scanf("%d", &n);
//////////	scanf("%d", &k);
//////////	int ret = Fib(n,k);
//////////	printf("%d", ret);
//////////}
////int Fib(int n, int k)
////{
////	if (k <= 0)
////	{
////		return 1;
////	}
////	else
////		return n * Fib(n, k-1 );
////}
////
////int main()
////{
////	int n = 0;
////	int k = 0;
////	scanf("%d", &n);
////	scanf("%d", &k);
////	int ret = Fib(n, k);
////	printf("%d", ret);
////}
////int print(int input)
////{
////	int n = 0;
////	int sum = 0;
////	if (input > 9)
////	{
////		print(input / 10);
////	}
////	n = input % 10;
////	return sum += n;
////
////}
////int main()
////{
////	int input = 0;
////	scanf("%d", &input);
////	int ret = print(input);
////	printf("%d", ret);
////	return 0;
////}
//////////
//////////
//////void  print(int arr)
//////{
//////	int i = 0;
//////    if(arr[i]>arr[])
//////
////////
////////
////////}
//int main()
//{
////	char arr[10] = "abcdef";
////	printf("%d", strlen("abcdef"));
////	return 0;
////}
////   
//int my_strlen(char *str)
//////{
//////	if (*str != '\0')
//////		return 1 + my_strlen(str + 1);
//////	else
//////		return 0;
//////
//////}
////int my_strlen(char* str)
////{
////	int count = 0;
////	while (*str != '\0')
////	{
////		count++;
////		str++;
////
////	}
////	return count;
////
////}
////
////int main()
////{
////	char arr[10] = "abcdef";
////	int len = my_strlen(arr);
////	printf("%d", len);
////
////	return 0;
//////}
//int Fib(int n)
//{
//	int ret = 1;
//	int i = 0;
//	for (i = 1; i <= n; i++)
//	{
//		ret = ret * i;
//
//	}
////////	return ret;
////////
////////}
//////int Fib(int n)
//////{
//////	if (n <= 1)
//////		return 1;
//////	else
//////		return n * Fib(n - 1);
//////}
//////int main()
//////{
//////	int n = 0;
//////	scanf("%d", &n);
//////	int ret = Fib(n);
//////	printf("%d", ret);
//////	return 0;
//////}
//////
//////
////////void print(int n)
////////{
////////	if (n > 9)
////////	{
////////		print(n / 10);
////////	}
////////		printf("%d ", n%10);
////////
////////
////////}
////////int main()
////////{
////////	int n = 1234;
////////	
////////	print(n);
////////
////////	return 0;
////////}
////////
////////
////////
////////
////////
////////
////////
////////
////////
////////
////////
////////
